COMMENT ⊗   VALID 00005 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.BEGIN TURN ON "|","$"
C00015 00003	.ref([MAC#74],|Bogen, R., 
C00022 00004	.ref([Sam#75],|Samet, H., 
C00026 00005	.ref([Wad#71], |Wadsworth, C., 
C00031 ENDMK
C⊗;
.BEGIN TURN ON "|","$";
.ref([And#76], |Anderson, D., 
.A brief critique of LISP, 
.AISB Conference, Essex, 1976|)

.ref([Bar#71], |Barbacci, M, $et al$, 
.C.ai#(P.LISP), A LISP processor of C.ai, 
.Carnegie-Mellon U., 1971|)

.ref([Bar#66],|Barron, D. and Strachey, C., 
.Programming, 
.Advances in computer programming and non-numerical computation (ed.#L.#Fox),49-82|)

.ref([Ber#64], |Berkekey, E., and Bobrow, D., 
.The programming language LISP:#Its operation and applications, 
.Information International, Cambridge, Mass., 1964|)

.ref([Ber#71], |Berkling, H., 
.A computing machine based on tree structures, 
.$IEEE Trans on Comptr. 20, C-20$, %24%1, (Apr.#71)|)

.ref([Ber#70], |Berry, D.,
.Block structure:#retention or deletion?, Tr#70-29, 
.Center for computer#&#Information Science, Brown#University, Dec#1970|)

.ref([Bis#74],|Bishop, P., 
.$Spaghetti Stacks$, 
.unpublished paper, M.I.T., Dec#19,#1974|)

.ref([Bis#74a],|Bishop, P., 
.Garbage collection in a very large address space, 
.Working paper#111, M.I.T.#A.I.#Lab, Sep.#1975|)

.REF([Bla#71],|Blair, F., 
.$The Structure of the Lisp Compiler$, 
.unpublished paper, 1971|)

.ref([Bob#73a], |Bobrow, D. and Wegbreit, B., 
.A model and stack implementation of multiple environments, 
.$Comm.#ACM#16$, %210%1, (Oct.#1973), 591-603|)

.ref([Bob#75], |Bobrow, D., 
.A note on hash linking, 
.$Comm.#ACM#18$, %27%1, (Jul.#1975), 413-414|)

.ref([Bob#73],|Bobrow, D. and Raphael, D., 
.New Programming Languages for A.I. Research 
.Stanford Research Institute, Menlo Park, Ca., 1973|)

.ref([Bob#67],|Bobrow, D. and Murphy, D., 
.The structure of a LISP system using two-level storage, 
.$Comm.#ACM#10$, %23%1, (Mar.#1967), xx-yy|)

.ref([Boy#75], |Boyer, R. and Moore, J, 
.Proving theorems about LISP functions, 
.$Jour.#ACM#$, %21%1, (Mar.#1975), 129-144|)

.ref([Car#76],|Cartwright, R., 
.A practical and Formal semantics and verification system for TYPED LISP, Ph.D.#Thesis, 
.Computer Science Dept., Stanford Univ., 1976|)

.ref([Che#70],|Cheney, C., 
.A Nonrecursive List Compacting Algorithm, 
.$Comm.#ACM#13$, %211%1, (Nov.#1970), 677-678|)

.ref([Che#67], |Cheatham, T., 
.The Theory & Construction of Compilers, 
.Computer Associates, Wakefield,#Mass., 1967|)

.ref([Chu#41], |Church, A., 
.The calculi of lambda conversion, 
.Annals of mathematics studies, Princeton University press, 1941|)

.ref([Con#74],|Conrad, W., 
.A compactifying garbage collector for ECL's non-homogeneous heap, TR.#2-74, 
.Center for Research in Computing Technology, Harvard, Feb.#1974|)

.ref([Con#73], |McDermott, D. and Sussman, G., 
.The CONNIVER Reference Manual, 
.M.I.T. A.I.#Lab.#Memo#259a, Cambridge, Mass#1973|)


.ref([Dar#73], |Darlington, J. and Burstall, R., 
.A system which automatically improves programs, 
.Proc. 3%8th%1 Int. J. Conf. on A.I., Stanford, 1975|)

.ref([Dif#71], |Diffie, W., 
.Documentation of the compiler, unpublished paper, 
.Stanford A.I. Lab., 1971|)

.ref([DSIPL], |Proceedings of a Symposium on Data Structures in Programming Languages, 
.$Sigplan Notices 6$, %22%1, (Feb.#1971)|)





.ref([EL1#74], |Wegbreit, Ben., 
.ECL programmer's manual, TR#23-74, 
.Center for Research in Computing Technology, Harvard Univ., Cambridge, Dec. 1974|)



.ref([Fel#68],|Feldman, J. and Greis, D., 
.Translator Writing Systems, 
.$Comm.#ACM 11$, %22%1, (Feb.#1968), 77-113|)

.ref([Fis#72],|Fischer, M., 
.Lambda Calculus schemata, 
.ACM Conf. on Proving assertions about programs, SIGPLAN Notices, Jan.#1972|)

.ref([Fis#70],|Fisher, D., 
.Control structures for programming languages, Ph.D.#Thesis, 
.Dept. of Computer Science, Carnegie-Mellon University, 1790|)
	
.ref([Fri#75], |Friedman, D. and Wise, D., 
.Multiple-valued Recursive Procedures, TR.#No.#27, 
.Computer Science Dept., Indiana University, Apr.#1975|)

.ref([Fri#75A, |Friedman, D. and Wise, D., 
.CONS Should Not Evaluate its Arguments, TR.#No.#44, 
.Computer Science Dept., Indiana University, Nov.#1975|)



.ref([Gol#73], |Goldstein, I., 
.Pretty printing:#converting list to linear structure, 
..M.I.T.#A.I.#Lab, Memo#279, Feb. 1973|)

.ref([Got#74],|Goto, E., 
.Monocopy and Associative Algorithms in an Extended Lisp, 
.University of Tokyo, Japan, May 1974|)

.ref([Gor#75], |Gordon, M., 
.Towards a semanitc theory of dynamic binding, 
.Stanford A.I. Lab. Memo#265, Stanford University, 1975|)

.ref([Gor#73], |Gordon, M., 
.Models of pure LISP, Experimental programming reports:#No.30, 
.Dept. of Machine Intelligence, University of Eningurgh, 1973|)

.REF([Got#76],|Goto, E. and Kanada, Y., 
.Recursive Hashed Data Structures with Applications to Polynomial Manipulations, 
.to be submitted to SYMSAC#76|)

.REF([Gri#71],|Gries, D., 
.Compiler Construction for digital computers, 
.Wiley, 1971|)

.ref([Gre#74],|Greenblatt, R., 
.The LISP machine, Working paper No.#79, 
.M.I.T., Nov.#1974|)

.ref([Gre#75], |Greussay, P., 
.Manual de Reference Provisoire:#LISP#T#1600, 
.Universite Paris, Feb.#1975|)

.REF([Gua#xx], |Guard, J., 
.Semi automated mathematics, 
.$Jrnl.#ACM#WRONG!!16$, %210%1, (Oct.#1973), 591-603|)



.ref([Ham#68], |Hammer, M., 
.Formal Definition of BASEL 
.|)


.ref([Han#69], |Hansen, W., 
.The Impact of Storage Management on Plex Processing Language Implementation, 
.Stanford Graphics Project, July#1969|)

.ref([Har#64], |Hart, T., and Evans, T., 
.Notes on implementing LISP for th M-460 computer, 
.in [Ber#64], 191-203|)

.ref([Har#75], |Howard, F.,
.Documentation of Harvard lisp, 
.xx|)

.ref([Hea#68],|Hearn, A., 
.REDUCE User's Manual, 
.Stanford AIM-50, Stanford University, 1968|)

.ref([Hen#76], |Henderson, P. and Morris, J., 
.A Lazy evaluator, 
.SIGPLAN-SIGACT Symposium on principles of programming languages, Altanta, Jan.#1976, 95-103|)

.ref([Hen#75],|von Henke, F., 
.On the representation of data structures in LCF with applications to program generation, 
.Stanford A.I.#Lab., Memo#AIM#267, Sep.#1975|)

.ref([Hew#75],|Hewitt, C. and Smith, B., 
.Towards a programming apprentice, 
.IEEE Trans. on Software Engineering, SE-1, (Mar#1975), 26-45|)

.ref([Hew#72], |Hewitt, C., 
.Description and Theoretical Analysis (using Schemata) of PLANNER, TR-258, 
.M.I.T. A.I. Lab., April 1972|)

.ref([Hew#76],|Hewitt, C., 
.Viewing Control  structures as patterns of passing messages, 
.Working paper#92, M.I.T.#A.I.#Lab, April#1976|)

.ref([Hoa#73a], |Hoare, C.A.R., 
.Hints on Programming Language Design, 
.Stanford AIM-224, (Dec.#1973)|)

.ref([Hoa#73], |Hoare, C.A.R., 
.Recursive data structures, 
.Stanford AIM-223, (Oct.#1973)|)


.ref([Int#75], |Tietelman, W., 
.INTERLISP reference manual, 
.Xerox Palo Alto Research Center, 1975|)


.ref([Kan#75],|Kanada, Y., 
.Implementation of HLISP and algebraic manipulation language REDUCE-2, Tr#75-01, 
.Information Sciences Lab. Univ. of Tokyo, Japan, Jan. 1975|)


.ref([Knu#68], |Knuth, D., 
.The Art of Computer Programming, non-numerical algorithms, 
.Vol.#1, Addison-Wesley, 1968|)

.ref([Knu#xx], |Knuth, D., 
.The Art of Computer Programming, searching and sorting, 
.Vol.#y, Addison-Wesley, 1968|)

.ref([Knu#74], |Knuth, D., 
.Structured Programming with GO TO statements, 
.$Computer Surveys 6$, 4, (Dec.#1974), 261-301|)




.ref([Joh#71],|Johnston, J., 
.The Contour Model of Block Structured Processes, 
.in [DISPL], 55-82|)


.ref([Lan#64], |Landin, P., 
.The mechanical evaluation of expressions, 
.$Computer#Journal#6$, %24%1, (Apr.#1964)|)

.ref([Lis#74], |Liskov, B. and Zilles, S., 
.Programming with abstract data structures, 
.Proc. of Symp. on Very high level languages, SIGPLAN Notices, Apr.#1974|)

.ref([Lon#71], |London, R., 
.Correctness of Two Compilers for a LISP Subset, 
.Stanford A.I.#Lab. Memo, AIM-151, Oct.#,1971|)

.ref([Lug#73], |Lugger, J. and Melenk, H., 
.Darstellung und Bearbeitung umfangreicher LISP-programme, 
.$Angewandte Informatik$, (Jun#1973), 257-263)|)
.ref([MAC#74],|Bogen, R., 
.MACSYMA reference manual, 
.Project MAC, Mathlab Group, M.I.T., Cambridge, 1974|)

.ref([Man#74], |Manna, Z., 
.Theory of Computation, 
.McGraw-Hill, New#York, 1974|)

.ref([McC#60], |McCarthy, J, 
.Recursive Functions of Symbolic Expressions and their Computation by Machine, 
.$Comm.#ACM$, (April#1960), 184-195|)

.ref([McC#63], |McCarthy, J., 
.A Basis for a Mathematical Theory of Computation, 
.in Computer Programming and Formal Systems, North Holland, Amsterdam, 1963|)

.ref([McC#61a], |McCarthy, J., 
.Micro algol 
.|)

.ref([McC#65], |McCarthy, J, $et. al$, 
.LISP 1.5 programmer's manual, 
.M.I.T. Press, Cambridge, 1965|)

.ref([McD#75], |McDermott, D., 
.Very large PLANNER-type data bases, A.I.#Memo#339, 
.A.I.#Lab, M.I.T., Cambridge, Mass, Sep.#1975|)

.ref([Men#64], |Mendelson, E., 
.Introduction to Mathematical Logic, 
.Van Nostrand, Princeton, New#Jersey, 1964|)

.ref([Mit#70], |Mitchell, J., 
.The design & construction of flexible & efficient interactive programming systems,  Ph.D.#thesis,
.Carnegie-Mellon Unversity, Jun. 1970|)

.ref([Mos#70], |Moses, Joel, 
.The function of FUNCTION in LISP, 
.Sigsam Bulletin, JUly 1970, 13-27|)

.ref([Moor#72], |Moore, J, 
.Thesis of proving properties 
.|)

.ref([Moor#75],|Moore, J, 
.The INTERLISP virtual machine specification (in preparation), 
.Xerox Palo Alto Research Center Report, 1975|)

.ref([Moo#76], |Moon, D., 
.$MacLISP Reference Manual$, 
.Laboratory for Computer Science, M.I.T., Cambridge, Mass, 1976|)

.ref([Mon#73], |Montangero, C., $et al$, 
.An extended LISP system for complex control-structure programming, 
.University of Pisa, 1973|)

.ref([Mon#75],|Montangero, C. $et al$, 
.Information Management in Context Trees, 
.University of Pisa, N.I.#B75-21, Oct. 1975|)

.ref([Mon#75a],|Montangero, C., $et al$, 
.MAGMA-Lisp: A `machine language' for Artifical Intelligence, 
.Proc. 4%8th%1 Int. J. Conf. on A.I., Tbilisi, (Sep. 1975), 556-561|)

.ref([Mic#71],|Sussman, G., $et al$, 
.Micro-PLANNER Reference Manual. AI#Memo#203a. 
.M.I.T., A.I.#Lab., Cambridge, Mass., (Dec#1971)|)

.ref([Mor#xx], |Morris, L., 
.Advice of structuring compilers and proving them correct, 
.144-152|)

.ref([Mor#yy],|Morris, J., 
.Towards more flexible type systems, 
.377-383|)


.ref([Mot#76],|Motoyoshi, F., 
.A portable LISP Compiler on a Hypothetical LISP Machine, TR#76-5, 
.Dept. of info. science, University of Tokyo, Japan, (Jan. 1976)|)

.ref([Mud#75],|Galley, S.W. and Pfister, G., 
.The MDL Language. Programming Technology Division Doc.#SYS.11.01. 
.Project Mac, M.I.T., Cambridge, Mass, (Nov.#1975)|)


.ref([Nor#70], |Nordstrom, M., $et al$, 
.LISP F1 - A Fortran implementation of LISP 1.5, 
.Computer Science Dept, Uppsala University, Sweden, 1970|)

.ref([Pac#73], |Pacini, G., 
.An Optimal Fix-point Computation Rule for a Simple Recursive Language, 
.University of Pisa, N.I.#B75-10, Oct. 1973|)

.ref([Pag#76], |Page, R., 
.LISP for Fairchild F8, Private communication, 
.1976|)

.ref([Per#67], |Perlis, A., 
.The synthesis of algorithmic systems, 
.$Jour.#ACM#x$, %21%1, (Jan.#1967), xxx-xxx|)

.ref([Pop#68], |Burstall, R., $et al$, 
.POP2 papers, 
.Oliver#&#Boyd, Eninburgh, 1968|)


.ref([Org#71], |Organick, E. and Cleary, J., 
.A Data Structure Model of the B6700 Computer System, 
.in [DISPL], 83-145|)

.ref([Qua#xx],|Quam, L.,& Diffie, W., 
.Stanford LISP#1.6 manual, SAILON#28.7, 
.Stanford A.I.#Lab., Stanford|)


.ref([Qua#68], |Quam, L., 
.SDIO manual, 
.unpublished paper, Stanford, 1968|)



.ref([Rey#68], |Reynolds, J., 
.Definitional interpreters for high-order programming languages, 
.ACM National convention, 1972|)

.ref([Ric#74], |Rich, C., and Shrobe, H., 
.Understanding LISP programs:#Towards a programming apprentice,
.Working paper#82, M.I.T.#A.I.#Lab, Dec.#1974|)

.ref([Rog#67], |Rogers, H., 
.Theory of Recursive Functions & Effective Computability, 
.McGraw-Hill, New#York, 1967|)

.ref([Sam#75],|Samet, H., 
.Automatically Proving the Correctness of Translations Involving Optimized Code, 
.Stanford A.I.#Lab. Memo, AIM-259, May#1975|)

.ref([San#75],|Sandewall, E., 
.Some Observations on Conceptual Programming, 
.Computer Science Dept., Uppsala University, Sweden, 1975|)

.ref([San#75a],|Sandewall, E., 
.Ideas about management of LISP data bases, Memo#332, 
.M.I.T. A.I. Lab., May#1975|)

.ref([San#76],|Sandewall, E., 
.Programming in an Interactive Environment: The LISP experience, 
.Linkoping University, 1976|)

.ref([Sco#72], |Scott, D., 
.Princeton paper on semantics 
.|)

.ref([Str#67],|Strachey, C., 
.Fundamental concepts in programming languages, 
.NATO Conference, Copenhagen, 1967|)

.ref([Ste#pc], |Steel, G., 
.private communications 
.|)

.ref([Ste#76b], |Steel, G. and  Sussman, G.,
.LAMBDA:#the ultimate imperative, 
.M.I.T.#A.I.#Memo#353, Mar.#1976|)

.ref([Ste#76a], |Steel, G. 
.Multiprocessing compactifying garbage collection, 
.$Comm.#ACM#18$, %29%1, (Sep.#1967), 495-508|)

.ref([Stei#74], |Steiger, R., 
.Actor machine architecture, M.S.#Thesis, 
.M.I.T., 1974|)

.ref([Sto#75], |Stoyan, H., 
.Comparison of two LISP compilers:#Stanford versus DOS/ES-LISP, 
.$Elektronische Informationsverarbeitung und Kybernetik#11$, 371-375|)

.ref([Sus#75], |Sussman, G. & Steel, G., 
.SCHEME: an interpreter for extended Lambda Calculus, 
.M.I.T.#A.I.#Memo#349, Dec.#1975|)

.ref([Sus#76], |Sussman, G. & Steel, G., 
.SCHEME Flash #1, 
.M.I.T.#A.I.Lab., Jan.#1976|)

.ref([Str#74],|Foy, N., 
.The Words Games of the Night Bird: Interview with C. Strachey, 
.$Computing#Europe$, Aug#15,#1974, pp10-11| )


.ref([Ten#76], |Tennent,R., 
.The denotational semantics of programming languages, 
.$Comm.#ACM#19$, %28%1, (Aug.#1967), 437-453|)

.ref([Tei#72], |Teitelman, W., 
.Automated Programmering#-#The programmer's assistant, 
.Proc. of the Fall Joint Computer Confr., Dec.#1972|)

.ref([Ter#75],|Terashima, M., 
.Algorithms used in an implementation of HLISP, Tr#75-03, 
.Information Sciences Lab. Univ. of Tokyo, Japan, Jan. 1975|)

.ref([Wad#71], |Wadsworth, C., 
.Semantics and Pragmatics of the Lambda-calculus, 
.Oxford, 1971|)

.ref([Wad#74], |Wadsworth, C., 
.continuations paper
.|)

.ref([Wad#xx], |Wadsworth, C., 
.The relation between Lambda-expressions and their denotations, unpublished paper, 
.Systems and Info. Science Dept, Syracuse Univ., 19xx|)

.ref([War#74], |Ward, S., 
.Functional domains of applicative languages, Ph.d.#thesis, MAC#TR-136, 
.M.I.T., Cambridge, Sep. 1974|)

.ref([Wegb#74],|Wegbreit, B., 
.The Treatment of Data Types in EL1, 
.$Comm. ACM 17$, %25%1, (May 1974), 251-264.|)

.ref([Wegb#75],|Wegbreit, B., 
.Retrieval from  context trees, 
.Information Processing Letters, 3, %24%1, 119-120, (March 1975)|)

.ref([Wegb#70], |Wegbreit, B., 
.Studies in Extensible Programming Languages
.Ph.D.thesis. Harvard University, Cambridge, Mass.,1970|)

.ref([Weg#70],|Wegner, P., 
.Three Computer Cultures-computer technology, computer mathematics & computer science,
.Advances in Computers, %210%1, 1970|)

.ref([Weg#71], |Wegner, P., 
.Data Structure Models for Programming Languages, 
.in [DISPL], 1-54|)

.REF([Weg#68],|Wegner, P.,
.Programming languages, information structures and machine orgainzation, 
.McGraw-Hill, 1968|)

.REF([Weg#69], |Wegner, P., 
.The Vienna Definition Language, 
.Computing Surveys|)

.ref([Wei#63], |Weismann, C.,
.LISP 1.5 primer, 
.Dickenson Press, 1967|)

.ref([Wei#68], |Weizenbaum, J., 
.The FUNARG Problem Explained, 
.unpublished memorandum, M.I.T., Cambridge, Mass., 1968|)

.ref([Win#75], |Winograd, T., 
.Breaking the complexity barrier#(again),
.$ACM SIGPLAN Notes 10$, %21%1, (Jan.#1975), 13-30|)

.ref([Wis#75],|Wise, D., $et.al$, 
.Boolean-valued loops, 
.Tr. No. 21, Indiana University Computer Science Dept, Jan. 1975|)

.END